A Combinatorial Approach to a Model of Constrained Random Walkers
نویسندگان
چکیده
In [1], the authors consider a random walk (Zn,1, . . . , Zn,K+1) ∈ Z K+1 with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first coordinate is proved and the limit variance is explicited. In this paper, we study an extended version of this model by conditioning the extremal coordinates to be at some fixed distance at every time. We prove a functional central limit theorem for this random walk. Using combinatorial tools, we give a precise formula of the variance and compare it with the one obtained in [1].
منابع مشابه
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملDATA ENVELOPMENT ANALYSIS WITH FUZZY RANDOM INPUTS AND OUTPUTS: A CHANCE-CONSTRAINED PROGRAMMING APPROACH
In this paper, we deal with fuzzy random variables for inputs andoutputs in Data Envelopment Analysis (DEA). These variables are considered as fuzzyrandom flat LR numbers with known distribution. The problem is to find a method forconverting the imprecise chance-constrained DEA model into a crisp one. This can bedone by first, defuzzification of imprecise probability by constructing a suitablem...
متن کاملA Novel Combinatorial Approach to Discrete Fracture Network Modeling in Heterogeneous Media
Fractured reservoirs contain about 85 and 90 percent of oil and gas resources respectively in Iran. A comprehensive study and investigation of fractures as the main factor affecting fluid flow or perhaps barrier seems necessary for reservoir development studies. High degrees of heterogeneity and sparseness of data have incapacitated conventional deterministic methods in fracture network modelin...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 2016